1704D - Magical Array - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SIZE 100000 + 1

int main(){
    ll tc;cin>>tc;
    while(tc--){
        ll n,m;cin>>n>>m;
        vector<pair<ll,ll>> vp;
        for(ll i=0;i<n;++i){
            ll ans=0;
            for(ll j=0;j<m;++j){
                ll a;cin>>a;
                ans+=(j+1)*a;
            }
            vp.push_back({ans,i+1});
        }
        sort(vp.rbegin(),vp.rend());
        cout<<vp[0].second<<" ";
        cout<<vp[0].first-vp[1].first<<endl;
    }
}